Multiset Codes for Permutation Channels
نویسندگان
چکیده
This paper introduces the notion of multiset codes as relevant to the problem of reliable information transmission over permutation channels. The motivation for studying permutation channels comes from the effect of out of order delivery of packets in some types of packet networks. The proposed codes are a generalization of the so-called subset codes, recently proposed by the authors. Some of the basic properties of multiset codes are established, among which their equivalence to integer codes under the Manhattan metric. The presented coding-theoretic framework follows closely the one proposed by Kötter and Kschischang for the operator channels. The two mathematical models are similar in many respects, and the basic idea is presented in a way which admits a unified view on coding for these types of channels.
منابع مشابه
Perfect codes in the discrete simplex
We study the problem of existence of (nontrivial) perfect codes in the discrete n-simplex ∆` := {( x0, . . . , xn ) : xi ∈ Z+, ∑ i xi = ` } under `1 metric. The problem is motivated by the so-called multiset codes, which have recently been introduced by the authors as appropriate constructs for error correction in the permutation channels. It is shown that e-perfect codes in the 1-simplex ∆` ex...
متن کاملEquidistant frequency permutation arrays and related constant composition codes
This paper introduces and studies the notion of an equidistant frequency permutation array (EFPA). An EFPA of length n = mλ, distance d and size v is defined to be a v×n array T such that 1) each row is a multipermutation on a multiset of m symbols, each repeated with frequency λ, and 2) the Hamming distance between any two distinct rows of T is precisely d. Such an array generalizes the well-s...
متن کاملMultiset Permutations in Lexicographic Order
In a previous work [12], we proposed a method for generating permutations in lexicographic order. In this study, we extend it to generate multiset permutations. A multiset is a collection of items that are not necessarily distinct. The guideline of the extension is to skip, as soon as possible, those partially-formed permutations that are less than or equal to the latest generated eligible perm...
متن کاملPermutation Modulation for Fading Channels
Permutation codes are special spherical codes designed for the band-limited Gaussian channel. Here, we investigate their application to fading channels: we present a simple maximum likelihood decoding algorithm and compute expressions for the codeword error probability.
متن کاملShift Gray Codes
Combinatorial objects can be represented by strings, such as 21534 for the permutation (1 2) (3 5 4), or 110100 for the binary tree corresponding to the balanced parentheses (()()). Given a string s = s1s2⋯sn, the right-shift operation ÐÐ→ shift(s, i, j) replaces the substring sisi+1⋯sj by si+1⋯sjsi. In other words, si is right-shifted into position j by applying the permutation (j j−1 ⋯ i) to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1301.7564 شماره
صفحات -
تاریخ انتشار 2013